Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Naïve differential evolution algorithm
WANG Shenwen, ZHANG Wensheng, QIN Jin, XIE Chengwang, GUO Zhaolu
Journal of Computer Applications    2015, 35 (5): 1333-1335.   DOI: 10.11772/j.issn.1001-9081.2015.05.1333
Abstract611)      PDF (434KB)(723)       Save

In order to solve singleness of mutation study, a naïve mutation strategy was proposed to approach the best individual and depart the worst one. So, a scale factor self-adaptation mechanism was used and the parameter was set to a small value when the dimension value of three random individuals is very close to each other, otherwise, set it to a large value. The results showed that the Differential Evolution (DE) with the new mechanism exhibits a robust convergence behavior measured by average number of fitness evaluations, successful running rate and acceleration rate.

Reference | Related Articles | Metrics
Hybrid fireworks explosion optimization algorithm using elite opposition-based learning
WANG Peichong GAO Wenchao QIAN Xu GOU Haiyan WANG Shenwen
Journal of Computer Applications    2014, 34 (10): 2886-2890.   DOI: 10.11772/j.issn.1001-9081.2014.10.2886
Abstract488)      PDF (719KB)(435)       Save

Concerning the problem that Fireworks Explosion Optimization (FEO) algorithm is easy to be premature and has low solution precision, an elite Opposition-Based Learning (OBL) was proposed. In every iteration, OBL was executed by the current best individual to generate an opposition search populations in its dynamic search boundaries, thus the search space of the algorithm was guided to approximate the optimum space. This mechanism is helpful to improve the balance and exploring ability of the FEO. For keeping the diversity of population, the sudden jump probability of the individual to the current best individual was calculated, and based on it, the roulette mechanism was adopted to choose the individual which entered into the child population. The experimental simulation on five classical benchmark functions show that, compared with the related algorithm, the improved algorithm has higher convergence rate and accuracy for numerical optimization, and it is suitable to solve the high dimensional optimization problem.

Reference | Related Articles | Metrics